A T=O(2^N/2), S=O(2^N/4) ALGORITHM FOR CERTAIN NP-COMPLETE PROBLEMSSCHROEPPEL R; ADI SHAMIR.1981; SIAM J. COMPUT.; ISSN 0097-5397; USA; DA. 1981; VOL. 10; NO 3; PP. 456-464; BIBL. 6 REF.Article

A T-S²=O(2^N) TIME/SPACE TRADEOFF FOR CERTAIN NP-COMPLETE PROBLEMSSCHROEPPEL R; ADI SHAMIR.1979; ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SICENCE. 20/1979/SAN JUAN P.R.; USA; NEW YORK: INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS; DA. 1979; PP. 328-336; BIBL. 7 REF.Conference Paper